-
1 decidable formula
Большой англо-русский и русско-английский словарь > decidable formula
-
2 decidable formula
Математика: разрешимая формула -
3 decidable formula
мат. -
4 formally decidable formula
Математика: формально разрешимая формулаУниверсальный англо-русский словарь > formally decidable formula
-
5 numeralwise decidable formula
Математика: нумерически разрешимая формулаУниверсальный англо-русский словарь > numeralwise decidable formula
-
6 formally decidable formula
English-Russian scientific dictionary > formally decidable formula
-
7 numeralwise decidable formula
English-Russian scientific dictionary > numeralwise decidable formula
-
8 decidable
разрешимый effectively decidable function ≈ эффективно разрешимая функция effectively decidable predicate ≈ эффективно разрешимый предикат effectively decidable relation ≈ эффективно разрешимое отношение formally decidable formula ≈ формально разрешимая формула numeralwise decidable formula ≈ нумерически разрешимая формула numeralwise decidable function ≈ нумерически разрешимая функция numeralwise decidable predicate ≈ нумерически разрешимый предикат - completely decidable - decidable algebra - decidable arithmetic - decidable formula - decidable language - decidable predicate - decidable proposition - decidable relation - decidable sentence - decidable set - decidable statement - decidable system - decidable theor - effectively decidable - formally decidable - numeralwise decidable - partially decidable разрешимый - * set (математика) разрешимое множествоБольшой англо-русский и русско-английский словарь > decidable
-
9 formula
1) рецепт2) формула || формульный3) формулировка•- arithmetically valid formula - back interpolation formula - computational formula - computing formula - corrector formula - formally decidable formula - formally refutable formula - formula of finite increments - geometrically valid formula - homomorphically stable formula - identically false formula - identically true formula - intuitionistically valid formula - logically valid formula - maximum likelihood formula - modally valid formula - monotonically increasing formula - numeralwise expressible formula - numeralwise representable formula - positively valid formula - primitively recursive formula - reciprocity formula - secondarily valid formula - square stable formula - universally valid formulato follow the formula — подчиняться [следовать] формуле; описываться формулой
-
10 разрешимая формула
Большой англо-русский и русско-английский словарь > разрешимая формула
-
11 predicate
логика1) предикат, сказуемое || предикатный2) утверждение || утверждать• -
12 predicate
1) вчт предикат (1. пропозициональная логическая функция, выражение с неопределёнными терминами 2. приписываемый объекту признак; свойство; отношение 3. сказуемое 4. рема, ядро, заключительная часть актуального членения предложения 5. ключевое слово (напр. в языках программирования SQL и Prolog)) || предикатный, предикативный3) утверждение || утверждать•- predicate with free variable
- algebraic predicate
- analytical predicate
- associated predicates
- atomic predicate
- basic predicate
- binary predicate
- Boolean predicate
- bounded predicate
- complete predicate
- completely defined predicate
- completely representable predicate
- computability predicate
- decidable predicate
- definable predicate
- derived predicate
- disjunctively definable predicate
- dyadic predicate
- enumerable predicate
- equality predicate
- exhaustive predicate
- expressible predicate
- first-order predicate
- formula predicate
- fuzzy predicate
- generable predicate
- general recursive predicate
- higher-order predicate
- Horn predicate
- invariant predicate
- irreducible predicate
- logic predicate
- monadic predicate
- multi-place predicate
- n-argument predicate
- niladic predicate
- n-place predicate
- nth order predicate
- numerical predicate
- one-place predicate
- polynomial predicate
- prime predicate
- primitively recursive predicate
- recursive predicate
- representable predicate
- resolvable predicate
- sameness predicate
- semantic predicate
- strong predicate
- triadic predicate
- two-place predicate
- unary predicate
- undecidable predicate
- unitary predicate
- universal predicate -
13 predicate
1) вчт. предикат (1. пропозициональная логическая функция, выражение с неопределёнными терминами2. приписываемый объекту признак; свойство; отношение 3. сказуемое 4. рема, ядро, заключительная часть актуального членения предложения 5. ключевое слово (напр. в языках программирования SQL и Prolog)) || предикатный, предикативный3) утверждение || утверждать•- analytical predicate
- associated predicates
- atomic predicate
- basic predicate
- binary predicate
- Boolean predicate
- bounded predicate
- complete predicate
- completely defined predicate
- completely representable predicate
- computability predicate
- decidable predicate
- definable predicate
- derived predicate
- disjunctively definable predicate
- dyadic predicate
- enumerable predicate
- equality predicate
- exhaustive predicate
- expressible predicate
- first-order predicate
- formula predicate
- fuzzy predicate
- generable predicate
- general recursive predicate
- higher-order predicate
- Horn predicate
- invariant predicate
- irreducible predicate
- logic predicate
- monadic predicate
- multi-place predicate
- n-argument predicate
- niladic predicate
- n-place predicate
- nth order predicate
- numerical predicate
- one-place predicate
- polynomial predicate
- predicate of predicates
- predicate with free variable
- prime predicate
- primitively recursive predicate
- recursive predicate
- representable predicate
- resolvable predicate
- sameness predicate
- semantic predicate
- strong predicate
- triadic predicate
- two-place predicate
- unary predicate
- undecidable predicate
- unitary predicate
- universal predicateThe New English-Russian Dictionary of Radio-electronics > predicate
См. также в других словарях:
Sahlqvist formula — In modal logic, Sahlqvist formulae are a certain kind of modal formula with remarkable properties. The Sahlqvist correspondence theorem states that everySahlqvist formula is canonical,and corresponds to a first order definable class of Kripke… … Wikipedia
Decidability (logic) — In logic, the term decidable refers to the decision problem, the question of the existence of an effective method for determining membership in a set of formulas. Logical systems such as propositional logic are decidable if membership in their… … Wikipedia
Admissible rule — In logic, a rule of inference is admissible in a formal system if the set of theorems of the system is closed under the rule. The concept of an admissible rule was introduced by Paul Lorenzen (1955).DefinitionsThe concept of admissibility, as… … Wikipedia
List of first-order theories — In mathematical logic, a first order theory is given by a set of axioms in somelanguage. This entry lists some of the more common examples used in model theory and some of their properties. PreliminariesFor every natural mathematical structure… … Wikipedia
formal logic — the branch of logic concerned exclusively with the principles of deductive reasoning and with the form rather than the content of propositions. [1855 60] * * * Introduction the abstract study of propositions, statements, or assertively used … Universalium
Decision problem — A decision problem has only two possible outputs, yes or no (or alternately 1 or 0) on any input. In computability theory and computational complexity theory, a decision problem is a question in some formal system with a yes or no answer,… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Church–Turing thesis — Church s thesis redirects here. For the constructive mathematics assertion, see Church s thesis (constructive mathematics). In computability theory, the Church–Turing thesis (also known as the Church–Turing conjecture, Church s thesis, Church s… … Wikipedia
Quantifier elimination — is a technique in mathematical logic, model theory, and theoretical computer science.We say that a given theory has quantifier elimination if for every sentence with quantification there exists an equivalent (modulo the theory) sentence without… … Wikipedia
Turing's proof — First published in January 1937 with the title On Computable Numbers, With an Application to the Entscheidungsproblem , Turing s proof was the second proof of the assertion (Alonzo Church proof was first) that some questions are undecidable :… … Wikipedia
Kripke semantics — (also known as relational semantics or frame semantics, and often confused with possible world semantics) is a formal semantics for non classical logic systems created in the late 1950s and early 1960s by Saul Kripke. It was first made for modal… … Wikipedia